FISHSPEAR : A PRIORITY QUEUE ALGORITHM ( Extended
نویسندگان
چکیده
The Fishspear priority queue algorithm is presented and analyzed. Fishspear makes fewer than 80% as many comparisons as heaps in the worst case, and its relative performance is even better in many common situations. The code itself embodies an unusual recursive structure which permits highly dynamic and datadependent execution. Fishspear also differs from heaps in that it can be implemented efficiently using sequential storage such as stacks or tapes, making it possibly attractive for implementation of very large queues on paged memory systems. (Details of the implementation are deferred to the full paper.)
منابع مشابه
A new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
متن کاملOn Solving Floating Point SSSP Using an Integer Priority Queue
We address the single source shortest path planning problem (SSSP) in the case of floating point edge weights. We show how any integer based Dijkstra solution that relies on a monotone integer priority queue to create a full ordering over path lengths in order to solve integer SSSP can be used as an oracle to solve floating point SSSP with positive edge weights (floating point P-SSSP). Floating...
متن کاملComputational evaluation of hot queues
The heap-on-top (hot) priority queue data structure 6] improves on the best known times for Dijkstra's shortest path algorithm. It also has very good practical performance and is robust over a wide range of graph types. The heart of Dijkstra's algorithm is a monotone priority queue, that is, a priority queue where no element on the queue ever becomes smaller than the most recently extracted ele...
متن کاملNew Strategies and Extensions in Kruskal's Algorithm in Multicast Routing
Multimedia applications are expected to guarantee end-to-end quality of service (QoS) and are characterized by stringent constraints on delay, delay-jitter, bandwidth, cost, and so forth. The authors observe that Kruskal’s algorithm is limited to minimal (maximal) spanning unconstrained tree. As such, the authors extend Kruskal’s algorithm to incorporate the delay bound constraint. Consequently...
متن کاملAU EIWRICAL COIUPARISON OF PRIORITY-QUEUE AUD EVEUFSET lMPLElWEUTd?lONS
During the last decade, a number of new priorityqueue implementations have evolved, including pagodas [6, 261, skew heaps [21, 221, splay trees [21, 231, pairing heaps 1183, and binomial queues [4, 5, 241. In addition, a number of special priority-queue implementations for representing the pending event set in discrete event simulation Shave been developed, including the two-list implementation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009